Decomposable maps in general tessellation structures
نویسندگان
چکیده
منابع مشابه
Complexity measures in decomposable structures
In this paper we present some measures of complexity of decomposable structures. The literature on complexity is reviewed and then the distinction among different measures of complexity is discussed. At first, a broad definition of complex systems is provided and the main characteristics of such systems are described briefly. In particular, a complex system is defined as a network of many highl...
متن کاملEfficient Bounded Adaptive Tessellation of Displacement Maps
Displacement mapping is a technique for applying fine geometric detail to a simpler base surface. The displacement is often specified as a scalar function which makes it relatively easy to increase visual complexity without the difficulties inherent in more general modeling techniques. We would like to use displacement mapping in real-time applications. Ideally, a graphics accelerator should cr...
متن کاملTessellation and Lyubich-Minsky laminations associated with quadratic maps II: Topological structures of 3-laminations
We investigate topological and combinatorial structures of Lyubich and Minsky’s affine and hyperbolic 3-laminations associated with the hyperbolic and parabolic quadratic maps. We begin by showing that hyperbolic rational maps in the same hyperbolic component have quasi-isometrically the same 3-laminations. Then we describe the topological and combinatorial changes of laminations associated wit...
متن کاملThe discrete dynamics of monotonically decomposable maps.
We extend results of Gouzé and Hadeler (in Nonlinear World 1:23-34, 1994) concerning the dynamics generated by a map on an ordered metric space that can be decomposed into increasing and decreasing parts. Our main results provide sufficient conditions for the existence of a globally asymptotically stable fixed point for the map. Applications to discrete-time, stage-structured population models ...
متن کاملMappings On Decomposable Combinatorial Structures: Analytic Approach
Combinatorics, Probability & Computing / Volume 11 / Issue 01 / January 2002, pp 61 78 DOI: 10.1017/S0963548301005016, Published online: 14 February 2002 Link to this article: http://journals.cambridge.org/abstract_S0963548301005016 How to cite this article: E. MANSTAVICIUS (2002). Mappings on Decomposable Combinatorial Structures: Analytic Approach. Combinatorics, Probability & Computing, 11, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90047-3